Additive Schwarz-type preconditioner for hermite cubic splines
نویسندگان
چکیده
منابع مشابه
Additive Schwarz-type preconditioner for hermite cubic splines
In the note, we prove that additive Schwarz type preconditioner is applicable to the nested finite dimensional subspaces generated by Hermite cubic splines for the second order elliptic problem. It is shown that the preconditioned system is well conditioned.
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملAn overlapping additive Schwarz preconditioner for the Laplace-Beltrami equation using spherical splines
We present an overlapping domain decomposition technique for solving the LaplaceBeltrami equation on the sphere with spherical splines. We prove that the condition number of the additive Schwarz operator is bounded by O (H/h), where H and h are the sizes of the coarse and fine meshes, respectively. In the case that the degree of the splines is even, a better bound O (max1≤k≤J (1 +Hk/δk)) is pro...
متن کاملGeometric Hermite interpolation by cubic G1 splines
In this paper, geometric Hermite interpolation by planar cubic G1 splines is studied. Three data points and three tangent directions are interpolated per each polynomial segment. Sufficient conditions for the existence of such G1 spline are determined that cover most of the cases encountered in practical applications. The existence requirements are based only upon geometric properties of data a...
متن کاملA Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superior to AS in terms of both iteration counts and CPU time, as well as the communication cost when implemented on distributed memory computers. This is especially true for harder problems such as indefi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2004
ISSN: 0893-9659
DOI: 10.1016/j.aml.2003.12.006